Software model-checking as cyclic-proof search
نویسندگان
چکیده
This paper shows that a variety of software model-checking algorithms can be seen as proof-search strategies for non-standard proof system, known cyclic system . Our use the logical foundation model checking enables us to compare different algorithms, reconstruct well-known from few simple principles, and obtain soundness proofs free. Among others, we show significance heuristics based on notion call maximal conservativity ; this explains cores important such property-directed reachability (PDR) reveals surprising connection an efficient solver games over infinite graphs was not regarded kind PDR.
منابع مشابه
Minimal Proof Search for Modal Logic K Model Checking
Most modal logics such as S5, LTL, or ATL are extensions of Modal Logic K. While the model checking problems for LTL and to a lesser extent ATL have been very active research areas for the past decades, the model checking problem for the more basic Multi-agent Modal Logic K (MMLK) has important applications as a formal framework for perfect information multi-player games on its own. We present ...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملModel Checking for π-Calculus Using Proof Search
Model checking for transition systems specified in π-calculus has been a difficult problem due to the infinite-branching nature of input prefix, name-restriction and scope extrusion. We propose here an approach to model checking for π-calculus by encoding it into a logic which supports reasoning about bindings and fixed points. This logic, called FOλ∆∇, is a conservative extension of Church’s S...
متن کاملSoftware Model Checking
In thes notes we will review the automata-theoretic verification method and propositional linear temporal logic, with specific emphasis on their potential application to distributed software verification. An important issue in software verification is the establishment of a formal relation between the concrete, implementation-level, software application and the abstract, derived, automata-model...
متن کاملTeaching Software Model Checking
The use of formal methods has become commonplace in hardware design, and is becoming increasingly widespread in software engineering. While formal methods have repeatedly been applied in safety-critical projects, their technologies and tools are not widely known, due to lack of in-depth education in current curricula. In this paper, we introduce the curriculum design of software model checking,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on programming languages
سال: 2022
ISSN: ['2475-1421']
DOI: https://doi.org/10.1145/3498725